package com.vint.mi;

import java.util.Stack;

/**
 */
public class Mi61 {
    public static String solution(String line){
        String[] src = line.split(";");
        for(int i=0;i<src.length;i++){
            for(int j=i+1;j<src.length;j++){
                if(src[i].equals(src[j])){
                    return (i+1)+","+(j+1);
                }
            }
        }
        return "";
    }
    public static void main(String[] args) {
        System.out.println(solution("1,0,0,1,0;0,1,1,0,0;1,0,0,1,0;0,0,1,1,0;0,1,0,0,0"));
    }
}
